Interest Rate Model Calibration Using Semidefinite Programming

نویسنده

  • Alexandre d'Aspremont
چکیده

We show that, for the purpose of pricing Swaptions, the Swap rate and the corresponding Forward rates can be considered lognormal under a single martingale measure. Swaptions can then be priced as options on a basket of lognormal assets and an approximation formula is derived for such options. This formula is centered around a Black-Scholes price with an appropriate volatility, plus a correction term that can be interpreted as the expected tracking error. The calibration problem can then be solved very efficiently using semidefinite programming.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Risk-Management Methods for the Libor Market Model Using Semidefinite Programming

When interest rate dynamics are described by the Libor Market Model as in Brace, Gatarek & Musiela (1997), we show how some essential risk-management results can be obtained from the dual of the calibration program. In particular, if the objetive is to maximize another swaption’s price, we show that the optimal dual variables describe a hedging portfolio in the sense of Avellaneda & Paras (1996...

متن کامل

A Recurrent Neural Network Model for Solving Linear Semidefinite Programming

In this paper we solve a wide rang of Semidefinite Programming (SDP) Problem by using Recurrent Neural Networks (RNNs). SDP is an important numerical tool for analysis and synthesis in systems and control theory. First we reformulate the problem to a linear programming problem, second we reformulate it to a first order system of ordinary differential equations. Then a recurrent neural network...

متن کامل

Stable Radial Distortion Calibration by Polynomial Matrix Inequalities Programming

Polynomial and rational functions are the number one choice when it comes to modeling of radial distortion of lenses. However, several extrapolation and numerical issues may arise while using these functions that have not been covered by the literature much so far. In this paper, we identify these problems and show how to deal with them by enforcing nonnegativity of certain polynomials. Further...

متن کامل

A path following interior-point algorithm for semidefinite optimization problem based on new kernel function

In this paper, we deal to obtain some new complexity results for solving semidefinite optimization (SDO) problem by interior-point methods (IPMs). We define a new proximity function for the SDO by a new kernel function. Furthermore we formulate an algorithm for a primal dual interior-point method (IPM) for the SDO by using the proximity function and give its complexity analysis, and then we sho...

متن کامل

Comparison of Statistical and Deterministic Frameworks of Uncertainty Quantification | SIAM/ASA Journal on Uncertainty Quantification | Vol. 4, No. 1 | Society for Industrial and Applied Mathematics

Two different approaches to the prediction problem are compared employing a realistic example— combustion of natural gas—with 102 uncertain parameters and 76 quantities of interests. One approach, termed bound-to-bound data collaboration (abbreviated to B2B), deploys semidefinite programming algorithms where the initial bounds on unknowns are combined with initial bounds of experimental data to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره cs.CE/0302034  شماره 

صفحات  -

تاریخ انتشار 2003